A Timed Mobility Semantics Based on Rewriting Strategies
نویسندگان
چکیده
We consider TiMo (Timed Mobility) which is a process algebra for prototyping software engineering applications supporting mobility and timing constraints. We provide an alternative semantics of TiMo using rewriting logic; in particular, we develop a rewriting logic model based on strategies to describe a maximal parallel computational step of a TiMo specification. This new semantical model is proved to be sound and complete w.r.t. to the original operational semantics which was based on negative premises. We implement the rewriting model within the strategy-based rewriting system Elan, and provide an example illustrating how a TiMo specification is executed and how a range of (behavioural) properties are analysed. About the authors Gabriel Ciobanu is a senior researcher at the Institute of Computer Science, Romanian Academy. He is also a Professor at "Alexandru Ioan Cuza" University of Iasi, Romania. Maciej Koutny obtained his MSc (1982) and PhD (1984) from the Warsaw University of Technology. In 1985 he joined the then Computing Laboratory of the University of Newcastle upon Tyne to work as a Research Associate. In 1986 he became a Lecturer in Computing Science at Newcastle, and in 1994 was promoted to an established Readership at Newcastle. In 2000 he became a Professor of Computing Science. Dr L. Jason Steggles is a lecturer in the School of Computing Science, University of Newcastle. His research interests lie in the use of formal techniques to develop correct computing systems. In particular, he has worked extensively on using algebraic methods for specifying, prototyping and validating computing systems. Suggested keywords PROCESS ALGEBRA MOBILITY TIME REWRITING LOGIC STRATEGIES A Timed Mobility Semantics based on Rewriting Strategies Gabriel Ciobanu, Maciej Koutny, and Jason Steggles Faculty of Computer Science, A. I. Cuza University of Iasi, 700483 Iasi, Romania. email: [email protected] Department of Computing Science, University of Newcastle, U. K. email: {maciej.koutny,jason.steggles}@ncl.ac.uk
منابع مشابه
Rewriting Logic as a Unifying Framework for Petri Nets
We propose rewriting logic as a unifying framework for a wide range of Petri nets models. We treat in detail place/transition nets and important extensions of the basic model by individual tokens, test arcs, and time. Based on the idea that “Petri nets are monoids” suggested by Meseguer and Montanari we define a rewriting semantics that maps place/transition nets into rewriting logic specificat...
متن کاملVerification of Complex Real-Time Systems using Rewriting Logic
This paper presents a method for model checking dense complex real-time systems. This approach is implemented at the meta level of the Rewriting Logic system Maude. The dense complex real-time system is specified using a syntax which has the semantics of timed automata and the property is specified with the temporal logic TLTL (Timed LTL). The well known timed automata model checkers Kronos and...
متن کاملA Timed Rewriting Logic Semantics for SDL: A Case Study of the Alternating Bit Protocol
SDL is an industrial standard formal description technique for telecommunication systems. Despite its wide spread use and industrial importance it lacks at present an adequate formal semantics integrating its static, dynamic, and real{time aspects. Timed Rewriting Logic (TRL) is a new variant of Rewriting Logic, an algebraic formalism which allows the dynamic behaviour of systems to be axiomati...
متن کاملA timed rewriting logic semantics for SDL: A case study of alternating bit protocol
SDL is an industrial standard formal description technique for telecommunication systems. Despite its wide spread use and industrial importance it lacks at present an adequate formal semantics integrating its static, dynamic, and real{time aspects. Timed Rewriting Logic (TRL) is a new variant of Rewriting Logic, an algebraic formalism which allows the dynamic behaviour of systems to be axiomati...
متن کاملVerification of Timed Automata Using Rewrite Rules and Strategies
ELAN is a powerful language and environment for specifying and prototyping deduction systems in a language based on rewrite rules controlled by strategies. Timed automata is a class of continuous real-time models of reactive systems for which efficient model-checking algorithms have been devised. In this paper, we show that these algorithms can very easily be prototyped in the ELAN system. This...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2012